A Simple Proof of the Four-Color Theorem
نویسنده
چکیده
A simpler proof of the four color theorem is presented. The proof was reached using a series of equivalent theorems. First the maximum number of edges of a planar graph is obatined as well as the minimum number of edges for a complete graph. Then it is shown that for the theorem to be false there must exist a complete planar graph of h edges such that h > 4. Finally the theorem is proved to be true by showing that there does not exist a complete planar graph with h > 4.
منابع مشابه
On Tychonoff's type theorem via grills
Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces, and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$. We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ related to these grills, and present a simple proof to this theorem. This immediately yields the classical theorem...
متن کاملA Human-Checkable Four-Color Theorem Proof
This paper presents a short and simple proof of the Four-Color Theorem, which can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has permitted it is presented in the Introduction. Mathematics Subject Classification (2010). Primary 05C10; Secondary 05C15.
متن کاملA new proof for the Banach-Zarecki theorem: A light on integrability and continuity
To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...
متن کاملA formal proof of the four color theorem
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we think, directed people to a rough road. Using a similar method to that for the formal proof of the five color theorem, a formal proof is proposed in this paper of the four color theorem, namely, every planar graph is four-colorable. The forma...
متن کاملOn Equivalent Color Transform and Four Coloring Theorem
In this paper, we apply an equivalent color transform (ECT) for a minimal k-coloring of any graph G. It contracts each color class of the graph to a single vertex and produces a complete graph Kk for G by removing redundant edges between any two vertices. Based on ECT, a simple proof for four color theorem for planar graph is then proposed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002